Kayles on Special Classes of Graphs - An Application of Sprague-Grundy Theory

Kayles and Nimbers

Kayles is a combinatorial game on graphs. Two players select alternatingly a vertex from a given graph G a chosen vertex may not be adjacent or equal to an already chosen vertex. The last player that can select a vertex wins the game. The problem to determine which player has a winning strategy is known to be PSPACE-complete. Because of certain characteristics of the Kayles game, it can be anal...

An Integer Programming Model and a Tabu Search Algorithm to Generate α-labeling of Special Classes of Quadratic Graphs

First, an integer programming model is proposed to find an α-labeling for quadratic graphs. Then, a Tabu search algorithm is developed to solve large scale problems. The proposed approach can generate α-labeling for special classes of quadratic graphs, not previously reported in the literature. Then, the main theorem of the paper is presented. We show how a problem in graph theory c...

Mist&-e Annihilation Games*

Graph games with an annihilation rule, as introduced by Conway, Fraenkel and Yesha, are studied under the midre play rule for progressively finite graphs that satisfy a condition on the reversibility of non-terminal Sprague-Grundy zeros to Spragu+Grundy ones. Two general theorems on the Spragu+Grundy zeros and ones are given, followed by two theorems characterizing the set of P-positions under ...

α Valuations of Special Classes of Quadratic Graphs

Intersection graphs associated with semigroup acts

The intersection graph $mathbb{Int}(A)$ of an $S$-act $A$ over a semigroup $S$ is an undirected simple graph whose vertices are non-trivial subacts of $A$, and two distinct vertices are adjacent if and only if they have a non-empty intersection. In this paper, we study some graph-theoretic properties of $mathbb{Int}(A)$ in connection to some algebraic properties of $A$. It is proved that the fi...